Optimal Codes for the Burst Erasure Channel
نویسنده
چکیده
We make the simple observation that the erasure burst correction capability of any (n, k) code can be extended to arbitrary lengths above n with the use of a block interleaver, and discuss nuances of this property when channel symbols are over GF(p) and the code is defined over GF(p ), J > 1. The results imply that maximum distance separable codes (e.g., Reed-Solomon) offer optimal burst erasure protection with linear complexity, and that the optimality does not depend on the length of the code.
منابع مشابه
Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures
This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. Every source message must be recovered perfectly at the destination subject to a fixe...
متن کاملRate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures
Recovery of data packets from packet erasures in a timely manner is critical for many streaming applications. An early paper by Martinian and Sundberg introduced a framework for streaming codes and designed rate-optimal codes that permit delay-constrained recovery from an erasure burst of length up to B. A recent work by Badr et al. extended this result and introduced a sliding-window channel m...
متن کاملBand Splitting Permutations for Spatially Coupled LDPC Codes Enhancing Burst Erasure Immunity
It is well known that spatially coupled (SC) codes with erasure-BP decoding have powerful error correcting capability over memoryless erasure channels. However, the decoding performance of SC-codes significantly degrades when they are used over burst erasure channels. In this paper, we propose band splitting permutations (BSP) suitable for (l, r, L) SC-codes. The BSP splits a diagonal band in a...
متن کاملA Modification Method for Constructing Low-Density Parity-Check Codes for Burst Erasures
We study a modification method for constructing lowdensity parity-check (LDPC) codes for solid burst erasures. Our proposed modification method is based on a column permutation technique for a parity-check matrix of the original LDPC codes. It can change the burst erasure correction capabilities without degradation in the performance over random erasure channels. We show by simulation results t...
متن کاملLDPC Codes For The Classic Bursty Channel
In this paper we consider low-density parity-check (LDPC) codes for the classic bursty channel. We present lower bounds on the maximum resolvable erasure burst length, Lmax, for arbitrary LDPC codes and then present constructions for LDPC codes with good burst erasure correction performance for channels with and without the presence of noise in the guard band.
متن کامل